Efficient all path score computations on grid graphs
نویسندگان
چکیده
منابع مشابه
Efficient All Path Score Computations on Grid Graphs
We study the Integer-weighted Grid All Paths Scores (IGAPS) problem, which is given a grid graph, to compute the maximum weights of paths between every pair of a vertex on the first row of the graph and a vertex on the last row of the graph. We also consider a variant of this problem, periodic IGAPS, where the input grid graph is periodic and infinite. For these problems, we consider both the g...
متن کاملShortest Path Computations in Source-Deplanarized Graphs
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a numuer of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
متن کاملShortest Path Computations in S-Graphs
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a number of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
متن کاملLeveraging Matrix Computations for Efficient Learning on Graphs∗
While several kernel functions for graphs have been proposed in the past, their practical applications so far are rather limited. One reason for this could be the fact that graphs are typically large, but applying standard implementations of kernel methods with graph kernels is not the most efficient solution. In this paper, we describe several ways to implement efficient kernel methods for gra...
متن کاملDrawing Graphs to Speed Up Shortest-Path Computations
We consider the problem of (repeatedly) computing singlesource single-target shortest paths in large, sparse graphs. Previous investigations have shown the practical usefulness of geometric speed-up techniques that guarantee the correctness of the result for shortest-path computations. However, such speed-up techniques utilize a layout of the graph which typically comes from geographic informat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.07.018